The Number of Sides of a Parallelogram
نویسندگان
چکیده
We define parallelograms of base a and b in a group. They appear as minimal relators in a presentation of a subgroup with generators a and b. In a Lie group they are realized as closed polygonal lines, with sides being orbits of left-invariant vector fields. We estimate the number of sides of parallelograms in a free nilpotent group and point out a relation to the rank of rational series. 1 Introduction In IR 2 a parallelogram of base a and b can be defined as a closed polygon with the minimum number of sides parallel to a and b. In that paper we also consider parallelograms defined in more general groups. In section 1. we first give some definitions and examples of parallelograms in Lie groups. These examples show the various complex situations occurring in the general case. In this paper we concentrate our attention on free nilpotent groups. This analysis will give universal properties for parallelograms. We obtain Theorem. The number of sides of a parallelogram on a free nilpotent group on two generators of order n is between n and n 2. We do not know what is the exact number of sides of parallelograms in a free nilpotent group neither how many non-equivalent parallelograms exist. We hope that an investigation of parallelograms might help understand general nilpotent groups. In particular it will be interesting to find presentations with relators of minimal size. We have chosen in this paper to recall the basic properties and constructions of free Lie algebras in order to make it self-contained. That is done in section 2. In the last section we then introduce mth-order parallelograms and prove our result. A connection with rational series is pointed out at the end of the paper. Our initial motivation to study parallelograms was the notion of curvature and holonomy of a connection for Riemannian manifolds and the generalization of those notions to sub-Riemannian geometry (see [FGR] and [BeR]). In classical differential geometry, curvature appears as the quadratic term in the asymptotic expansion of holonomy around short (four-sided) parallelograms, holonomy being the 1365–8050 c ¢ measure of the difference of the vector field by parallel translation around a closed loop. In the case of sub-Riemannian manifolds, the tangent space is naturally a nilpotent group ([BeR]) and the holonomy associated to it will be calculated using parallelograms with many sides. The analog of sectional curvatures should …
منابع مشابه
ar X iv : 0 90 5 . 02 98 v 1 [ m at h . C O ] 4 M ay 2 00 9 Point - sets in general position with many similar copies of a pattern Bernardo
For every pattern P , consisting of a finite set of points in the plane, SP (n,m) is defined as the largest number of similar copies of P among sets of n points in the plane without m points on a line. A general construction, based on iterated Minkovski sums, is used to obtain new lower bounds for SP (n,m) when P is an arbitrary pattern. Improved bounds are obtained when P is a triangle or a re...
متن کاملAn Area Inequality for Ellipses Inscribed in Quadrilaterals
If E is any ellipse inscribed in a convex quadrilateral, D – , then we prove that Area (E) Area(D – ) π 4 , and equality holds if and only if D – is a parallelogram and E is tangent to the sides of D – at the midpoints. We also prove that the foci of the unique ellipse of maximal area inscribed in a parallelogram, D – , lie on the orthogonal least squares line for the vertices of D – . This doe...
متن کاملThe Particle Filter and Extended Kalman Filter methods for the structural system identification considering various uncertainties
Structural system identification using recursive methods has been a research direction of increasing interest in recent decades. The two prominent methods, including the Extended Kalman Filter (EKF) and the Particle Filter (PF), also known as the Sequential Monte Carlo (SMC), are advantageous in this field. In this study, the system identification of a shake table test of a 4-story steel struct...
متن کاملA Maximal Parallelogram Characterization of Ovals Having Circles as Orthoptic Curves
It is shown that ovals admitting circles as orthoptic curves are precisely characterized by the property that every one of their points is the vertex of exactly one maximal-perimeter inscribed parallelogram. This generalizes an old property of ellipses, most recently revived by Connes and Zagier in the paper A Property of Parallelograms Inscribed in Ellipses. Let C be a centrally symmetric smoo...
متن کاملThe Australian Journal of Mathematical Analysis and Applications
We prove that there exists a unique ellipse of minimal eccentricity, EI , inscribed in a parallelogram, Ð. We also prove that the smallest nonnegative angle between equal conjugate diameters of EI equals the smallest nonnegative angle between the diagonals of Ð. We also prove that if EM is the unique ellipse inscribed in a rectangle, R, which is tangent at the midpoints of the sides of R, then ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics & Theoretical Computer Science
دوره 3 شماره
صفحات -
تاریخ انتشار 1999